Complexity equals change

نویسندگان

  • Aleksandar Aksentijevic
  • Keith Gibson
چکیده

Traditionally, models of complexity used in psychology have been based on probabilistic and algorithmic paradigms. While these models have inspired a great deal of research, they are generally opaque about the relationship between complexity and the cost of information processing. We argue that the psychological complexity is easily defined and quantified in terms of change and support this argument with a measure of complexity for binary patterns. We extend our measure to 2-D binary arrays, and show that it correlates well with a number of existing complexity and randomness measures, both subjective and objective. We suggest that measuring change represents an intuitively and mathematically transparent way of defining and quantifying psychological complexity which provides the missing link between subjective and objective approaches to complexity. 2011 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotic Stability Equals Exponential Stability, and Iss Equals Nite Energy Gain|if You Twist Your Eyes

In this paper we show that uniformly global asymptotic stability for a family of ordinary diierential equations is equivalent to uniformly global exponential stability under a suitable nonlinear change of variables. The same is shown for input-to-state stability and input-to-state exponential stability, and for input-to-state exponential stability and a nonlinear H 1 estimate.

متن کامل

Asymptotic stability equals exponential stability, and ISS equals finite energy gain—if you twist your eyes

In this paper we show that uniformly global asymptotic stability for a family of ordinary differential equations is equivalent to uniformly global exponential stability under a suitable nonlinear change of variables. The same is shown for input-to-state stability and input-to-state exponential stability, and for input-to-state exponential stability and a nonlinear H∞ estimate.

متن کامل

Probabilistic Communication Complexity of Boolean Relations

In [KW] it was proved that for every boolean function $f$ there exist a communication complexity game $R_f$ such that the minimal circuit-depth of $f$ exactly equals to the communication complexity of $R_f$. If $f$ is monotone then there also exists a game $R_f^m$ with communication complexity exactly equals to the monotone depth of $f$. It was also proved in [KW] that the communication complex...

متن کامل

A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints

This paper introduces the SEQ BIN meta-constraint with a polytime algorithm achieving generalized arc-consistency. SEQ BIN can be used for encoding counting constraints such as CHANGE, SMOOTH, or INCREASING NVALUE. For all of them the time and space complexity is linear in the sum of domain sizes, which improves or equals the best known results of the literature.

متن کامل

Effective symbolic dynamics, random points, statistical behavior, complexity and entropy

We consider the dynamical behavior of Martin-Löf random points in dynamical systems over metric spaces with a computable dynamics and a computable invariant measure. We use computable partitions to define a sort of effective symbolic model for the dynamics. Through this construction we prove that such points have typical statistical behavior (the behavior which is typical in the Birkhoff ergodi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Cognitive Systems Research

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2012